Performance analysis of a PCS network with state-dependent calls arrival processes and impatient calls
نویسندگان
چکیده
This paper studies the behavior of performance evaluation for a personal communication services (PCS) network, in which the calls' arrival process may depend on the number of calls in the target cells. Each cell of the PCS network consists of a ®nite channel and a buffer (with ®nite or in®nite size) for handoff calls. The handoff calls having to wait in the buffer for further communication may become impatient and leave the system if their waiting time exceeds their own patience. The mobilities of the portables are characterized by the random cell residence times of the portables. For insight into the effect of dependent calls arrival processes and the impatient calls on PCS network performance, we propose an analytical model and obtain the expressions for the following interesting conventional and new performance measures: the new call blocking probability, handoff call failure probability and the forced termination probability of a handoff call; the quasi and actual waiting time of a handoff call in the buffer; the actual call holding time of a new call; and the blocking period of time of the new calls and the handoff calls etc. We also provide an algorithm to compare these blocking probabilities and the arrival rates for handoff calls. Some special cases of our model used in previous traf®c models of wireless and/or wireline communications are discussed. The results presented in this paper can provide guidelines for ®eld data processing on updated PCS network design and performance evaluation. q 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Adaptive call admission control and resource allocation in multi server wireless/cellular network
The ever increasing demand of the subscribers has put pressure on the capacity of wireless networks around the world. To utilize the scare resources, in the present paper we propose an optimal allocation scheme for an integrated wireless/cellular model with handoff priority and handoff guarantee services. The suggested algorithm optimally allocates the resources in each cell and dynamically adj...
متن کاملPCS networks with correlated arrival process and retrial phenomenon
In this paper, the arrival of new calls and handoff calls to a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. A new call will retry again if the first attempt is blocked. The PCS network consists of homogeneous ce...
متن کاملPerformance Analysis of Single Server Retrial Queue with General Retrial Time, Impatient Subscribers, Two Phases of Service and Bernoulli Schedule
This paper analyses the steady state behaviour of an M/G/1 retrial queue with impatient subscribers, two phases of essential service, general retrial time and general vacation time. If the primary call, on arrival finds the server busy, becomes impatient and leaves the system with probability (1 ) and with probability , it enters into an orbit. The server provides preliminary first essential se...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملA Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. The PCS network consists of homogeneous cells and each cell consists of a finite number of chan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 25 شماره
صفحات -
تاریخ انتشار 1999